Computational problems - PDFSEARCH.IO - Document Search Engine

Computational problems
Results: 809

#	Item
41	Table of Contents Use Cases (Target Problems)...........................................................................................................................1 Family alignment: identify homologues, generate fa Add to Reading List Source URL: informatics.nescent.org Language: English - Date: 2016-04-13 13:52:16 Biology Bioinformatics Computational phylogenetics Genetics Population genetics Molecular biology Protein structure Sequence alignment Single-nucleotide polymorphism BLAST Protein superfamily Conserved sequence
42	TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel Add to Reading List Source URL: comopt.ifi.uni-heidelberg.de Language: English - Date: 2013-06-19 04:16:58 Graph theory Mathematics Computational complexity theory NP-complete problems Graph Travelling salesman problem Vertex Cycle Hamiltonian path Graph automorphism Vertex cover
43	OPTIMIZING PHYLOGENETIC DIVERSITY ACROSS TWO TREES MAGNUS BORDEWICH, CHARLES SEMPLE, AND ANDREAS SPILLNER Abstract. We present a polynomial-time algorithm for finding an optimal set of taxa that maximizes the weighted-su Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2007-10-09 08:45:20 Graph theory Mathematics Computational complexity theory NP-complete problems Combinatorial optimization Matching Flow network 3-dimensional matching Vertex cover
44	Brief Bio and (PR)2: Problems & Pitches – Rants & Raves by Kevin Boyack Brief Biography Kevin W. Boyack recently joined SciTech Strategies, Inc. (www.mapofscience.com) after working for 17 years at Sandia National Labo Add to Reading List Source URL: vw.slis.indiana.edu Language: English - Date: 2008-02-25 14:18:50 American Association for the Advancement of Science Katy Brner Computational science Computer graphics Infographics Scientometrics Visualization Bioinformatics Academia Science and technology
45	LNCSFixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction Add to Reading List Source URL: www.cs.tau.ac.il Language: English - Date: 2009-01-01 08:42:54 Computational complexity theory Graph theory Mathematics Phylogenetics NP-complete problems Computational phylogenetics Analysis of algorithms Probabilistic complexity theory Randomized algorithm Steiner tree problem Algorithm Maximum parsimony
46	Scalable Flow-Based Community Detection for Large-Scale Network Analysis Seung-Hee Bae∗ , Daniel Halperin∗ , Jevin West† , Martin Rosvall‡ and Bill Howe∗ ∗ Department of Computer Science and Engineering, Uni Add to Reading List Source URL: www.jevinwest.org Language: English - Date: 2015-11-11 00:05:03 Mathematics Computational complexity theory NP-complete problems Algorithm Mathematical logic Theoretical computer science Graph partition Community structure Connectivity
47	A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Amit Kumar ∗ Anupam Gupta† Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2004-09-21 15:30:36 Graph theory Mathematics Computational complexity theory NP-complete problems Combinatorial optimization Edsger W. Dijkstra Spanning tree Operations research Shortest path problem Graph Linear programming Steiner tree problem
48	IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 26, NO. X, Add to Reading List Source URL: www.cs.uoi.gr Language: English - Date: 2014-10-21 22:17:09 Mathematics Operations research Computational complexity theory Combinatorics Combinatorial optimization NP-complete problems Set cover problem Greedy algorithm Heuristic Integer programming Matching Linear programming
49	CS264: Beyond Worst-Case Analysis The Top 10 List∗ Tim Roughgarden† December 3, 2014 We covered a lot of concepts in this course. To appreciate this, let’s review the overarching narrative of the course via a top 1 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-12-24 18:09:21 Computational complexity theory Theory of computation Mathematics Analysis of algorithms Operations research Mathematical optimization NP-complete problems Smoothed analysis Algorithm Competitive analysis Best worst and average case Time complexity
50	Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Anupam Gupta∗ Amit Kumar† Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2004-09-21 15:30:39 Graph theory Mathematics Computational complexity theory NP-complete problems Steiner tree problem XTR Shortest path problem Flow network Maximum flow problem Graph coloring